Stochastic Enumeration Method for Counting Trees

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Enumeration Method for Counting Trees

The problem of estimating the size of a backtrack tree is an important but hard problem in computational sciences. An efficient solution of this problem can have a major impact on the hierarchy of complexity classes. The first randomized procedure, which repeatedly generates random paths through the tree, was introduced by Knuth. Unfortunately, as was noted by Knuth and a few other researchers,...

متن کامل

Stochastic Enumeration and Splitting Methods for Counting Self-Avoiding Walks

We present a new method for counting self-avoiding walks (SAW’s), called stochastic enumeration (SE), a stochastic replica of the naive (computationally intractable) full enumeration method. Also presented is a new approach, called OSLA-SPLIT, a combination of classic splitting with importance sampling. The latter is based on the well-known method, onestep-look-ahead (OSLA) method. Polynomial c...

متن کامل

Algorithms for Propositional Model Enumeration and Counting

A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and hybrid solvers. Besides practical applications, the problem of counting propositional models is of key relevancy in computational complexity. In recent years a number of algorithms have been proposed for propositional ...

متن کامل

Counting Trees

Let t n denote the number of unlabeled trees on n vertices. Let t(x) = P 1 n=1 t n x n be the corresponding generating function. Similarly, let T n , h n , and i n denote the numbers of rooted trees, homeomorphically irreducible trees, and identity trees on n vertices, respectively. (Homeomorphically irre-ducible trees have no vertices of degree 2, and identity trees have trivial au-tomorphism ...

متن کامل

Enumeration of Weighted Trees

In weighted trees, all edges are endowed with positive integral weight. We enumerate weighted bicolored plane trees according to their weight and number of edges. 1 Preliminaries This paper is not intended for publication: it does not contain difficult results, and the proofs use only standard and well-known techniques. However, the results stated below have their place in the context of the st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Methodology and Computing in Applied Probability

سال: 2015

ISSN: 1387-5841,1573-7713

DOI: 10.1007/s11009-015-9457-4